Verified Parallel String Matching in Haskell

An Implementation of Parallel Pattern-Matching via Concurrent Haskell

The Implementation and Optimisation of Parallel Pattern Matching in Haskell

Parallel pattern matching provides true commutative implementation of functions defined by cases in functional languages, because no argument is given precedence over any other. We present a formal semantics of parallel pattern matching and describe an implementation in Haskell that maps individual argument component matches into Concurrent Haskell threads. The performance of the Concurrent Has...

A Tale of Two Provers

Abstract We demonstrate for the €rst time that Liquid Haskell, a re€nement type checker for Haskell programs, can be used for arbitrary theorem proving by verifying a monoidal string matching algorithm implemented in Haskell. We use re€nement types to specify correctness properties, Haskell terms to express proofs of these properties, and Liquid Haskell to check the proofs. We evaluate Liquid H...

Measuring Naira: a Symbolic Program with Irregular Parallelism

Naira is a compiler for Haskell, written in Glasgow parallel Haskell. It exhibits modest, but irregular parallelism that is determined by properties of the program being compiled, e.g. the complexity of the types and of the pattern-matching. We report four experiments into Naira’s parallel behaviour using a set of realistic inputs: namely the 18 Haskell modules of Naira itself. The issues inves...

Re ning a Parallel Algorithm For Calculating

String players know that bowing properly is the hardest skill they have to learn. In other work 4], we develop an algorithm that calculates bowings for BowTech, a project that supports string performers. This algorithm takes a signiicant amount of time to execute (in our second test case, over an hour for the implementation, written in Ada). We have implemented the algorithm in GpH, a parallel ...